Comparing two trainable grammatical relations finders
نویسنده
چکیده
Grammatical relationships (Glls) form an impor tant level of natural language processing, but different sets of ORs are useflfl for different purposes. Theretbre, one may often only have time to obtain a small training corpus with the desired GI1. annotations. On s u & a small training corpus, we compare two systems. They use difl'erent learning tedmiques, but we find that this difference by itself only has a minor effect. A larger factor is that iLL English, a different GI/. length measure appears bet ter suited for finding simple m:gument GI{s than ~br finding modifier GRs. We also find that partitioning the data ma W help memory-based learning.
منابع مشابه
Learning Transformation Rules to Find Grammatical Relations
Appears in Computational Natural Language Learning (CoNLL-99), pages 43-52. A workshop at the 9th Conf. of the European Chapter of the Assoc. for Computational Linguistics (EACL-99). Bergen, Norway, June, 1999. cs.CL/9906015 Grammatical relationships are an important level of natural language processing. We present a trainable approach to find these relationships through transformation sequence...
متن کاملTigrScan and GlimmerHMM: two open source ab initio eukaryotic gene-finders
UNLABELLED We describe two new Generalized Hidden Markov Model implementations for ab initio eukaryotic gene prediction. The C/C++ source code for both is available as open source and is highly reusable due to their modular and extensible architectures. Unlike most of the currently available gene-finders, the programs are re-trainable by the end user. They are also re-configurable and include s...
متن کاملCascaded Grammatical Relation Assignment
In this paper we discuss cascaded MemoryBased grammatical relations assignment. In the first stages of the cascade, we find chunks of several types (NP,VP,ADJP,ADVP,PP) and label them with their adverbial function (e.g. local, temporal). In the last stage, we assign grammatical relations to pairs of chunks. We studied the effect of adding several levels to this cascaded classifier and we found ...
متن کاملA Trainable Method For Extracting Chinese Entity Names And Their Relations
In this paper we propose a trainable method for extracting Chinese entity names and their relations. We view the entire problem as series of classification problems and employ memory-based learning (MBL) to resolve them. Preliminary results show that this method is efficient, flexible and promising to achieve better performance than other existing methods.
متن کاملUsing Grammatical Relations to Compare Parsers
We use the grammatical relations (GRs) described in Carroll et al. (1998) to compare a number of parsing algorithms A first ranking of the parsers is provided by comparing the extracted GRs to a gold standard GR annotation of 500 Susanne sentences: this required an implementation of GR extraction software for Penn Treebank style parsers. In addition, we perform an experiment using the extracted...
متن کامل